Faster Algorithms for Constructing a Concept (Galois) Lattice
نویسنده
چکیده
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is faster than all other existing algorithms for these problems.
منابع مشابه
Faster Algorithms for Constructing a Galois Lattice, Enumerating All Maximal Bipartite Cliques and Closed Frequent Sets
In this paper, we give a fast algorithm for constructing a Galois lattice of a binary relation. When the binary relation is represented as a bipartite graph, each vertex of the lattice (called a concept) corresponds to a maximal bipartite clique of the bipartite graph. Thus, our algorithm also enumerates all maximal bipartite cliques. Further, our algorithm can be naturally modified to compute ...
متن کاملA partition-based approach towards constructing Galois (concept) lattices
Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both eÆcient and exible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction ...
متن کاملClassification Reasoning as a Model of Human Commonsense Reasoning
In this article, it is proposed to consider classification reasoning based on inducing and using implicative dependencies as a model of commonsense reasoning. The main concept of this reasoning is a good classification test considered as a formal concept of the FCA. The Galois lattice is used for constructing good classification tests. Special rules are determined for constructing Galois lattic...
متن کاملTowards scalable divide-and-conquer methods for computing concepts and implications
Formal concept analysis (FCA) studies the partially ordered structure induced by the Galois connection of a binary relation between two sets (usually called objects and attributes), which is known as the concept lattice or the Galois lattice. Lattices and FCA constitute an appropriate framework for data mining, in particular for association rule mining, as many studies have practically shown. H...
متن کاملA partition - based approach towards constructingGalois ( concept )
Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both eecient and exible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0602069 شماره
صفحات -
تاریخ انتشار 2006